A modified algorithm for accurate inverse Cholesky factorization
نویسندگان
چکیده
منابع مشابه
A modified algorithm for accurate inverse Cholesky factorization
Let R be the set of real numbers, and F a set of floating-point numbers conforming to IEEE standard 754. The relative rounding error unit of floating-point arithmetic is denoted by u. In binary64 (double precision) arithmetic, u = 2−53 ≈ 1.1 × 10−16. Throughout this paper, we assume that neither overflow nor underflow occurs. For A ∈ Rn×n, define κ(A) := ‖A‖ · ‖A−1‖ as the condition number of A...
متن کاملA Revised Modified Cholesky Factorization Algorithm
A modified Cholesky factorization algorithm introduced originally by Gill and Murray and refined by Gill, Murray and Wright, is used extensively in optimization algorithms. Since its introduction in 1990, a different modified Cholesky factorization of Schnabel and Eskow has also gained widespread usage. Compared with the Gill-Murray-Wright algorithm, the Schnabel-Eskow algorithm has a smaller a...
متن کاملA New Modified Cholesky Factorization
The modified Cholesky factorization of Gill and Murray plays an important role in optimization algorithms. Given a symmetric but not necessarily positive definite matrix A, it computes a Cholesky factorization ofA +E, where E= if A is safely positive definite, and E is a diagonal matrix chosen to make A +E positive definite otherwise. The factorization costs only a small multiple of n 2 operati...
متن کاملA High Performance Sparse Cholesky Factorization Algorithm
This paper presents a new parallel algorithm for sparse matrix factorization. This algorithm uses subforest-to-subcube mapping instead of the subtree-to-subcube mapping of another recently introduced scheme by Gupta and Kumar 13]. Asymptotically, both formulations are equally scalable on a wide range of architectures and a wide variety of problems. But the subtree-to-subcube mapping of the earl...
متن کاملA Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
This paper presents a new left-looking parallel sparse Cholesky fac,torization algorithm for shared-memory MIMD multiprocessors. The algorithm is particularly well-suited for vector supercomputers with multiple processors, such as the Cray Y-MP. The new algorithm uses supernodes in the Cholesky factor to improve performance by reducing indirect addressing and memory traffic. Earlier factorizati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Theory and Its Applications, IEICE
سال: 2014
ISSN: 2185-4106
DOI: 10.1587/nolta.5.35